package com.test.daily.leetcode.y2022.m05.day0522.v06;

/**
 * @descriptions:
 * @author: Tom
 * @date: 2022/5/22 下午 07:34
 * @version: 1.0
 */
public class Solution {
    public static void print(int N){
        process(1, N, true);
    }
    public static void process(int i, int N, boolean flag){
        if(i > N){
            return;
        }
        process(i+1, N, true);
        System.out.println(flag ? "凹": "凸");
        process(i+1, N, false);
    }
}
